//2740.找出分区值
//https://leetcode.cn/problems/find-the-value-of-the-partition
class Solution {
public:
    int findValueOfPartition(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        int n = nums.size();
        int ret = INT_MAX;
        for(int i = 1;i<n;++i) ret = min(nums[i]-nums[i-1],ret);
        return ret;
    }
};